The Semantics of Reifying n-ary Relationships as Classes

نویسندگان

  • Mohamed Dahchour
  • Alain Pirotte
چکیده

Many data models do not directly support -ary relationships. In most cases, they are either reduced to some of their binary projections or directly translated into an -ary “relationship relation” in the relational model. This paper addresses the reification of an -ary relationship into a new class with binary relationships and studies the preservation of semantics in the translation. It shows that some semantics may be lost unless some explicit constraints are added to the binary schema.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On exact category of $(m, n)$-ary hypermodules

We introduce and study category of $(m, n)$-ary hypermodules as a generalization of the category of $(m, n)$-modules as well as the category of classical modules. Also, we study various kinds of morphisms. Especially, we characterize monomorphisms and epimorphisms in this category. We will proceed to study the fundamental relation on $(m, n)$-hypermodules, as an important tool in the study of a...

متن کامل

NEW TYPES OF FUZZY n-ARY SUBHYPERGROUPS OF AN n-ARY HYPERGROUP

In this paper, the new notions of ``belongingness ($in_{gamma}$)"and ``quasi-coincidence ($q_delta$)"  of a fuzzy point with a fuzzyset are  introduced. By means of this new idea, the  concept of$(alpha,beta)$-fuzzy $n$-ary subhypergroup of an $n$-aryhypergroup is given, where $alpha,betain{in_{gamma}, q_{delta},in_{gamma}wedge q_{delta}, ivq}$,  andit is shown that, in 16 kinds of $(alpha,beta...

متن کامل

Topological structure on generalized approximation space related to n-arry relation

Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...

متن کامل

Application of fundamental relations on n-ary polygroups

The class of  $n$-ary polygroups is a certain subclass of $n$-ary hypergroups, a generalization of D{"o}rnte $n$-arygroups and  a generalization of polygroups. The$beta^*$-relation and the $gamma^*$-relation are the smallestequivalence relations on an $n$-ary polygroup $P$ such that$P/beta^*$ and $P/gamma^*$ are an $n$-ary group and acommutative $n$-ary group, respectively. We use the $beta^*$-...

متن کامل

Study of Random Biased d-ary Tries Model

Tries are the most popular data structure on strings. We can construct d-ary tries by using strings over an alphabet leading to d-ary tries. Throughout the paper we assume that strings stored in trie are generated by an appropriate memory less source. In this paper, with a special combinatorial approach we extend their analysis for average profiles to d-ary tries. We use this combinatorial appr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002